Complexity and algorithms for recognizing polar and monopolar graphs
نویسندگان
چکیده
منابع مشابه
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs
We consider the recognition problem for two graph classes that generalize split and unipolar graphs, respectively. First, we consider the recognizability of graphs that admit a monopolar partition: a partition of the vertex set into sets A,B such that G[A] is a disjoint union of cliques and G[B] an independent set. If in such a partition G[A] is a single clique, then G is a split graph. We show...
متن کاملm-polar intuitionistic graphs and its properties
In many real world problems, data sometimes comes from n agents (n≥2), multipolar information exists. For issues that are associated with uncertainty, this information can not be showed with the values of crisp, fuzzy, intuitionistic or bipolar. Graph is one of the mathematical models widely used in different sciences. Ambiguity in a graph where data depends on the n parameter can not be showed...
متن کاملRecognizing Polar Planar Graphs Using New Results for Monopolarity
Polar and monopolar graphs are natural generalizations of bipartite or split graphs. A graph G = (V,E) is polar if its vertex set admits a partition V = A∪B such thatA induces a complete multipartite and B the complement of a complete multipartite graph. If A is even a stable set then G is called monopolar. Recognizing general polar or monopolar graphs is NP-complete and, as yet, efficient reco...
متن کاملNC Algorithms for Recognizing Chordal Graphs and k Trees
We present parallel algorithms for recognizing the chordal graphs and k trees. Under the model of computation PRAM with concurrent reading and writing allowed, these algorithms take O(log n) time and require O(n4) processors. Our algorithms have an improved processor-bound than an independent result by Edenbrandt for recognizing chordal graphs in parallel using O(n3m) processors. Furthermore, o...
متن کاملLinear algorithms for recognizing and parsing superpositional graphs
Structurally synthesized binary decision diagrams (SSBDD) are a special type of BDDs that are generated by superposition according to the structure of propositional formula. Fast algorithms for simulation, diagnostic reasoning and test generation running on SSBDDs exploit their specific properties. Hence the correctness of SSBDDs should be checked before using those algorithms. The problem of r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.01.032